Chunky and equal-spaced polynomial multiplication
نویسندگان
چکیده
منابع مشابه
Chunky and Equal-Spaced Polynomial Multiplication
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead employ the technique of adaptive analysis to give an improvement in many “easy” cases. We present two adaptive measures and methods for polynomial multiplication, and also show how to effectively combine them to gain both...
متن کاملAlgebraic adjoint of the polynomials-polynomial matrix multiplication
This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field
متن کاملBivariate Polynomial Multiplication
Inspired by the discussion in [5], we study the multiplicative complexity and the rank of the multiplication in the local algebras Rm;n = k[x; y]=(xm+1; yn+1) and Tn = k[x; y]=(xn+1; xny; : : : ; yn+1) of bivariate polynomials. We obtain the lower bounds (2 13 o(1)) dimRm;n and (2 12 o(1)) dim Tn for the multiplicative complexity of the multiplication in Rm;n and Tn, respectively. On the other ...
متن کاملAdaptive Polynomial Multiplication
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead employ the technique of adaptive analysis to give an improvement in many “easy” cases where other algorithms are doing too much work. Three ideas for adaptive polynomial multiplication are given. One method, which we call...
متن کاملAdaptive Polynomial Interpolation on Evenly Spaced Meshes
The problem of oscillatory polynomial interpolants arising from equally spaced mesh points is considered. It is shown that by making use of adaptive approaches that the oscillations may be contained and that the resulting polynomials are data bounded and monotone on each interval. This is achieved at the cost of using a different polynomial on each sub-interval. Computational results for a numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2011
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2010.08.013